The two-echelon multi-products location-routing problem with pickup and delivery: formulation and heuristic approaches
Identifieur interne : 000100 ( Main/Exploration ); précédent : 000099; suivant : 000101The two-echelon multi-products location-routing problem with pickup and delivery: formulation and heuristic approaches
Auteurs : Younes Rahmani ; Wahiba Ramdane Cherif-Khettaf [France] ; Ammar Oulamara [France]Source :
- International Journal of Production Research [ 0020-7543 ] ; 2016.
English descriptors
- mix :
Abstract
The two-echelon location-routing problem (LRP-2E) considers the first-level routes that serve from one depot a set of processing centres, which must be located and the second-level routes that serve customers from the opened processing centres. In this paper, we consider an extension of the LRP-2E, where the second-level routes include three constraints that have not been considered simultaneously in the location routing literature, namely multi-product, pickup and delivery, and the use of the processing centre as intermediate facility in the second-level routes. This new variant is named two-Echelon Multi-products Location-Routing problem with Pickup and Delivery (LRP-MPPD-2E). The objective of LRP-MPPD-2E is to minimise both the location and the routing costs, considering the new constraints. The first echelon deals with the selection of processing centres from a set of potential sites simultaneously with the construction of the first-level routes, such that each route starts from the main depot, visits the selected processing centres and returns to the main depot. The second echelon aims at assigning customers to the selected processing centres and defining the second-level routes. Each second-level route, starts at a processing centre, visits a set of customers, through one or several processing centres, and then returns to the first processing centre. We present a mixed-integer linear model for the problem and use a Cplex solver to solve small-scale instances. Furthermore, we propose non-trivial extensions of the nearest neighbour and insertion approaches. We also develop clustering-based approaches that have not been extensively investigated with regards to location routing. Computational experiments are conducted to evaluate and to compare the performances of the proposed approaches. The results confirm the effectiveness of clustering approaches.
Url:
DOI: 10.1080/00207543.2015.1040127
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 004D01
- to stream Hal, to step Curation: 004D01
- to stream Hal, to step Checkpoint: 000105
- to stream Main, to step Merge: 000098
- to stream Main, to step Curation: 000100
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">The two-echelon multi-products location-routing problem with pickup and delivery: formulation and heuristic approaches</title>
<author><name sortKey="Rahmani, Younes" sort="Rahmani, Younes" uniqKey="Rahmani Y" first="Younes" last="Rahmani">Younes Rahmani</name>
</author>
<author><name sortKey="Ramdane Cherif Khettaf, Wahiba" sort="Ramdane Cherif Khettaf, Wahiba" uniqKey="Ramdane Cherif Khettaf W" first="Wahiba" last="Ramdane Cherif-Khettaf">Wahiba Ramdane Cherif-Khettaf</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-456092" status="INCOMING"><orgName>Optimist</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-206040" type="direct"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-234725" status="VALID"><idno type="IdRef">179233335</idno>
<idno type="RNSR">201320864B</idno>
<idno type="IdUnivLorraine">[UL]RSJ--</idno>
<orgName>Laboratoire de Conception, Optimisation et Modélisation des Systèmes</orgName>
<orgName type="acronym">LCOMS</orgName>
<date type="start">2013-01-01</date>
<desc><address><addrLine>LCOMS EA7306, Université de Lorraine, Metz 57000, France</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://lcoms.univ-lorraine.fr/</ref>
</desc>
<listRelation><relation name="EA7306" active="#struct-413289" type="direct"></relation>
</listRelation>
<tutelles><tutelle name="EA7306" active="#struct-413289" type="direct"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01307014</idno>
<idno type="halId">hal-01307014</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-01307014</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-01307014</idno>
<idno type="doi">10.1080/00207543.2015.1040127</idno>
<date when="2016">2016</date>
<idno type="wicri:Area/Hal/Corpus">004D01</idno>
<idno type="wicri:Area/Hal/Curation">004D01</idno>
<idno type="wicri:Area/Hal/Checkpoint">000105</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000105</idno>
<idno type="wicri:doubleKey">0020-7543:2016:Rahmani Y:the:two:echelon</idno>
<idno type="wicri:Area/Main/Merge">000098</idno>
<idno type="wicri:Area/Main/Curation">000100</idno>
<idno type="wicri:Area/Main/Exploration">000100</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">The two-echelon multi-products location-routing problem with pickup and delivery: formulation and heuristic approaches</title>
<author><name sortKey="Rahmani, Younes" sort="Rahmani, Younes" uniqKey="Rahmani Y" first="Younes" last="Rahmani">Younes Rahmani</name>
</author>
<author><name sortKey="Ramdane Cherif Khettaf, Wahiba" sort="Ramdane Cherif Khettaf, Wahiba" uniqKey="Ramdane Cherif Khettaf W" first="Wahiba" last="Ramdane Cherif-Khettaf">Wahiba Ramdane Cherif-Khettaf</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-456092" status="INCOMING"><orgName>Optimist</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-206040" type="direct"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-234725" status="VALID"><idno type="IdRef">179233335</idno>
<idno type="RNSR">201320864B</idno>
<idno type="IdUnivLorraine">[UL]RSJ--</idno>
<orgName>Laboratoire de Conception, Optimisation et Modélisation des Systèmes</orgName>
<orgName type="acronym">LCOMS</orgName>
<date type="start">2013-01-01</date>
<desc><address><addrLine>LCOMS EA7306, Université de Lorraine, Metz 57000, France</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://lcoms.univ-lorraine.fr/</ref>
</desc>
<listRelation><relation name="EA7306" active="#struct-413289" type="direct"></relation>
</listRelation>
<tutelles><tutelle name="EA7306" active="#struct-413289" type="direct"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1080/00207543.2015.1040127</idno>
<series><title level="j">International Journal of Production Research</title>
<idno type="ISSN">0020-7543</idno>
<imprint><date type="datePub">2016</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term> heuristics</term>
<term> location-routing</term>
<term> mixed integer programming</term>
<term> pickup and delivery</term>
<term> vehicle routing</term>
<term>distribution network</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The two-echelon location-routing problem (LRP-2E) considers the first-level routes that serve from one depot a set of processing centres, which must be located and the second-level routes that serve customers from the opened processing centres. In this paper, we consider an extension of the LRP-2E, where the second-level routes include three constraints that have not been considered simultaneously in the location routing literature, namely multi-product, pickup and delivery, and the use of the processing centre as intermediate facility in the second-level routes. This new variant is named two-Echelon Multi-products Location-Routing problem with Pickup and Delivery (LRP-MPPD-2E). The objective of LRP-MPPD-2E is to minimise both the location and the routing costs, considering the new constraints. The first echelon deals with the selection of processing centres from a set of potential sites simultaneously with the construction of the first-level routes, such that each route starts from the main depot, visits the selected processing centres and returns to the main depot. The second echelon aims at assigning customers to the selected processing centres and defining the second-level routes. Each second-level route, starts at a processing centre, visits a set of customers, through one or several processing centres, and then returns to the first processing centre. We present a mixed-integer linear model for the problem and use a Cplex solver to solve small-scale instances. Furthermore, we propose non-trivial extensions of the nearest neighbour and insertion approaches. We also develop clustering-based approaches that have not been extensively investigated with regards to location routing. Computational experiments are conducted to evaluate and to compare the performances of the proposed approaches. The results confirm the effectiveness of clustering approaches.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Metz</li>
<li>Nancy</li>
</settlement>
<orgName><li>Université de Lorraine</li>
</orgName>
</list>
<tree><noCountry><name sortKey="Rahmani, Younes" sort="Rahmani, Younes" uniqKey="Rahmani Y" first="Younes" last="Rahmani">Younes Rahmani</name>
</noCountry>
<country name="France"><region name="Grand Est"><name sortKey="Ramdane Cherif Khettaf, Wahiba" sort="Ramdane Cherif Khettaf, Wahiba" uniqKey="Ramdane Cherif Khettaf W" first="Wahiba" last="Ramdane Cherif-Khettaf">Wahiba Ramdane Cherif-Khettaf</name>
</region>
<name sortKey="Oulamara, Ammar" sort="Oulamara, Ammar" uniqKey="Oulamara A" first="Ammar" last="Oulamara">Ammar Oulamara</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000100 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000100 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= Hal:hal-01307014 |texte= The two-echelon multi-products location-routing problem with pickup and delivery: formulation and heuristic approaches }}
This area was generated with Dilib version V0.6.33. |